An Investigation of a Tabu Assisted Hyper-Heuristic Genetic Algorithm
نویسندگان
چکیده
This paper investigates a tabu assisted genetic algorithm based hyper-heuristic (hyper-TGA) for personnel scheduling problems. We recently introduced a hyper-heuristic genetic algorithm (hyper-GA) with an adaptive length chromosome which aims to evolve an ordering of low-level heuristics in order to find good quality solutions to given problems. The addition of a tabu method, the focus of this paper, extends that work. The aim of adding a tabu list to the hyper-GA is to indicate the efficiency of each gene within the chromosome. We apply the algorithm to a geographically distributed training staff and course scheduling problem and compare the computational results with our previous hyper-GA.
منابع مشابه
A genetic algorithm selection perturbative hyper-heuristic for solving the school timetabling problem
Research in the domain of school timetabling has essentially focused on applying various techniques such as integer programming, constraint satisfaction, simulated annealing, tabu search and genetic algorithms to calculate a solution to the problem. Optimization techniques like simulated annealing, tabu search and genetic algorithms generally explore a solution space. Hyper-heuristics, on the o...
متن کاملAn Investigation of a Tabu Search Based Hyper-heuristic for Examination Timetabling
This paper investigates a tabu search based hyper-heuristic for solving examination timetabling problems. The hyper-heuristic framework uses a tabu list to monitor the performance of a collection of low-level heuristics and then make tabu heuristics that have been applied too many times, thus allowing other heuristics to be applied. Experiments carried out on examination timetabling datasets fr...
متن کاملOptimum Routing in the Urban Transportation Network by Integrating Genetic Meta-heuristic (GA) and Tabu Search (Ts) Algorithms
Urban transportation is one of the most important issues of urban life especially in big cities. Urban development, and subsequently the increase of routes and communications, make the role of transportation science more pronounced. The shortest path problem in a network is one of the most basic network analysis issues. In fact, finding answers to this question is necessity for higher level ana...
متن کاملA comprehensive analysis of hyper-heuristics
Meta-heuristics such as simulated annealing, genetic algorithms and tabu search have been successfully applied to many difficult optimization problems for which no satisfactory problem specific solution exists. However, expertise is required to adopt a metaheuristic for solving a problem in a certain domain. Hyper-heuristics introduce a novel approach for search and optimization. A hyper-heuris...
متن کاملKSATS-HH: A Simulated Annealing Hyper-Heuristic with Reinforcement Learning and Tabu-Search
The term hyper-heuristics describes a broad range of techniques that attempt to provide solutions to an array of problems from different domains. This paper describes the implementation of a hyperheuristic developed for entry into the Cross-domain Heuristic Search Challenge organised by the Automated Scheduling, Optimisation and Planning research group at the University of Nottingham. An algori...
متن کامل